Explicit Dynamic Algorithm for MLS Difference Method
نویسندگان
چکیده
منابع مشابه
genetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملOn an explicit finite difference method for fractional diffusion equations
A numerical method to solve the fractional diffusion equation, which could also be easily extended to many other fractional dynamics equations, is considered. These fractional equations have been proposed in order to describe anomalous transport characterized by non-Markovian kinetics and the breakdown of Fick’s law. In this paper we combine the forward time centered space (FTCS) method, well k...
متن کاملExplicit Finite Difference Method For Convection-Diffusion Equations
In this paper, we present an integral form of convection-diffusion equation. Then a class of alternating group explicit finite difference method (AGE) is constructed based on several asymmetric schemes. The AGE method is unconditionally stable and has the property of parallelism. Results of numerical examples show the AGE method is of high accuracy.
متن کاملExplicit finite-difference lattice Boltzmann method for curvilinear coordinates.
In this paper a finite-difference-based lattice Boltzmann method for curvilinear coordinates is proposed in order to improve the computational efficiency and numerical stability of a recent method [R. Mei and W. Shyy, J. Comput. Phys. 143, 426 (1998)] in which the collision term of the Boltzmann Bhatnagar-Gross-Krook equation for discrete velocities is treated implicitly. In the present method,...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2011
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2011.07.344